Square-root algorithms for least-squares estimation
نویسندگان
چکیده
منابع مشابه
A unified square-root-free approach for QRD-based recursive-least-squares estimation
Givens rotation is the most commonly used method in performing the QR decomposition (QRD) updating. The generic formula for these rotations requires explicit square-root (sqrt) computations which constitute a computational bottleneck and are quite undesirable from the practical VLSI circuit design point of view. So far, there has been more than ten known sqrt-free algorithms. In this correspond...
متن کاملA square root covariance algorithm for constrained recursive least squares estimation
In this contribution, a covariance counterpart is described of the information matrix approach to constrained recursive least squares estimation. Unlike information-type algorithms, covariance algorithms are amenable to parallel implementation, e.g. on processor arrays, and this is also demonstrated. As compared to previously described combined covariance-information algorithms/arrays, the pres...
متن کاملSquare-Root Algorithms of Recursive Least-Squares Wiener Estimators in Linear Discrete-Time Stochastic Systems
This paper addresses the QR decomposition and UD factorization based square-root algorithms of the recursive least-squares (RLS) Wiener fixed-point smoother and filter. In the RLS Wiener estimators, the Riccati-type difference equations for the auto-variance function of the filtering estimate are included. Hence, by the roundoff errors, in the case of the small value of the observation noise va...
متن کاملFast algorithms for least-squares-based minimum variance spectral estimation
The minimum variance (MV) spectral estimator is a robust high-resolution frequencydomain analysis tool for short data records. The traditional formulation of the minimum variance spectral estimation (MVSE) depends on the inverse of a Toeplitz autocorrelation matrix, for which a fast computational algorithm exists that exploits this structure. This paper extends the MVSE approach to two data-onl...
متن کاملError Estimation for Randomized Least-Squares Algorithms via the Bootstrap
Over the course of the past decade, a variety of randomized algorithms have been proposed for computing approximate least-squares (LS) solutions in large-scale settings. A longstanding practical issue is that, for any given input, the user rarely knows the actual error of an approximate solution (relative to the exact solution). Likewise, it is difficult for the user to know precisely how much ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 1975
ISSN: 0018-9286
DOI: 10.1109/tac.1975.1100994